Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem
نویسندگان
چکیده
منابع مشابه
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem
The Quadratic Assignment Problem (QAP) consists of assigning n facilities to n locations so as to minimize the total weighted cost of interactions between facilities. The QAP arises in many diverse settings, is known to be NP-hard, and can be solved to optimality only for fairly small size instances (typically, n ≤ 25). Neighborhood search algorithms are the most popular heuristic algorithms to...
متن کاملA very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
We propose a metaheuristic algorithm for the multi-resource generalizedassignment problem (MRGAP). MRGAP is a generalization of the generalized assignmentproblem, which is one of the representative combinatorial optimization problems knownto be NP-hard. The algorithm features a very large-scale neighborhood search, which is amechanism of conducting the search with complex and po...
متن کاملVery Large-Scale Neighborhood Search
Neighborhood search algorithms are often the most effective approaches available for solving partitioning problems, a difficult class of combinatorial optimization problems arising in many application domains including vehicle routing, telecommunications network design, parallel machine scheduling, location theory, and clustering. A critical issue in the design of a neighborhood search algorith...
متن کاملA Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model
The fleet assignment model (FAM) for an airline assigns fleet types to the set of flight legs that satisfies a variety of constraints and minimizes the cost of the assignment. A through connection at a station is a connection between an arrival flight and a departure flight at the station, both of which have the same fleet type assigned to them that ensures that the same plane flies both legs. ...
متن کاملA Very Large-Scale Neighborhood Search Algorithm for the Combined Through and Fleet Assignment Model
The fleet assignment model (FAM) for an airline assigns fleet types to the set of flight legs that satisfies a variety of constraints and minimizes the cost of the assignment. A through connection at a station is a connection between an arrival flight and a departure flight at the station, both of which have the same fleet type assigned to them that ensures that the same plane flies both legs. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2007
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.1060.0201